A Memetic Algorithm for a Break Scheduling Problem
نویسندگان
چکیده
In this paper we regard a break scheduling problem originating in the area of supervision personnel. This complex task requires the assignment of several breaks per shift, satisfying various constraints reflecting labour rules, staffing requirements and ergonomic criteria. To solve this problem we propose a memetic algorithm combining a genetic algorithm and a local search procedure. We evaluate the presented memetic algorithm on publicly available benchmark instances and compare the obtained results to an existing min-conflicts based algorithm. The memetic algorithm is able to return competitive results and for half of the regarded instances it computes solutions of improved quality.
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملA Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کامل